Random directed graphs are robustly Hamiltonian
نویسندگان
چکیده
منابع مشابه
Cores of random graphs are born Hamiltonian
Let {Gt}t≥0 be the random graph process (G0 is edgeless and Gt is obtained by adding a uniformly distributed new edge to Gt−1), and let τk denote the minimum time t such that the k-core of Gt (its unique maximal subgraph with minimum degree at least k) is nonempty. For any fixed k ≥ 3 the k-core is known to emerge via a discontinuous phase transition, where at time t = τk its size jumps from 0 ...
متن کاملSparse pseudo-random graphs are Hamiltonian
In this article we study Hamilton cycles in sparse pseudorandom graphs. We prove that if the second largest absolute value of an eigenvalue of a d-regular graph G on n vertices satisfies
متن کاملHamiltonian Cycles in Directed Toeplitz Graphs
Hamiltonian Cycles in Directed Toeplitz Graphs Dr Shabnam Malik Faculty of Mathematics, Forman Christian College University, Lahore Pakistan An (n × n) matrix A = (aij) is called a Toeplitz matrix if it has constant values along all diagonals parallel to the main diagonal. A directed Toeplitz graph is a digraph with Toeplitz adjacency matrix. In this talk I will discuss conditions for the exist...
متن کاملBipartite Kneser Graphs are Hamiltonian
The Kneser graph K(n, k) has as vertices all k-element subsets of [n] := {1, 2, . . . , n} and an edge between any two vertices (=sets) that are disjoint. The bipartite Kneser graph H(n, k) has as vertices all k-element and (n−k)-element subsets of [n] and an edge between any two vertices where one is a subset of the other. It has long been conjectured that all connected Kneser graphs and bipar...
متن کامل10-Gabriel graphs are Hamiltonian
Given a set S of points in the plane, the k-Gabriel graph of S is the geometric graph with vertex set S, where pi, pj ∈ S are connected by an edge if and only if the closed disk having segment pipj as diameter contains at most k points of S \ {pi, pj}. We consider the following question: What is the minimum value of k such that the k-Gabriel graph of every point set S contains a Hamiltonian cyc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2015
ISSN: 1042-9832
DOI: 10.1002/rsa.20631